Large Scale Parallelization Of Alpha-Beta Search
نویسندگان
چکیده
منابع مشابه
(\alpha, \beta) Fibonacci Search
Knuth [12, Page 417] states that “the (program of the) Fibonaccian search technique looks very mysterious at first glance” and that “it seems to work by magic”. In this work, we show that there is even more magic in Fibonaccian (or else Fibonacci) search. We present a generalized Fibonacci procedure that follows perfectly the implicit optimal decision tree for search problems where the cost of ...
متن کاملAlpha - Beta - Conspiracy Search ( Draft of Oct
We introduce a variant of-search in which each node is associated with two depths rather than one. The purpose of-search is to nd strategies for each player that together establish a value for the root position. A max strategy establishes a lower bound and the min strategy establishes an upper bound. It has long been observed that forced moves should be searched more deeply. Here we make the ob...
متن کاملOPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING MODIFIED CHARGED SYSTEM SEARCH
Optimal design of large-scale structures is a rather difficult task and the computational efficiency of the currently available methods needs to be improved. In view of this, the paper presents a modified Charged System Search (CSS) algorithm. The new methodology is based on the combination of CSS and Particle Swarm Optimizer. In addition, in order to improve optimization search, the sequence o...
متن کاملLarge Scale Image Search
We address the problem of large scale image search, for which many recent methods use a bag-of-features image representation. We shows the sub-optimality of such a representation for matching descriptors and derive a more precise representation based on 1) Hamming embedding (HE) and 2) weak geometric consistency constraints (WGC). HE provides binary signatures that refine the matching based on ...
متن کاملParallelization of MAFFT for large-scale multiple sequence alignments.
Summary We report an update for the MAFFT multiple sequence alignment program to enable parallel calculation of large numbers of sequences. The G-INS-1 option of MAFFT was recently reported to have higher accuracy than other methods for large data, but this method has been impractical for most largescale analyses, due to the requirement of large computational resources. We introduce a scalable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 1990
ISSN: 2468-2438,1389-6911
DOI: 10.3233/icg-1990-13206